Generalized Covering Groups and Direct Limits

نویسندگان

  • B. Mashayekhy
  • H. Mirebrahimi
چکیده مقاله:

این مقاله چکیده ندارد

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Baer-Invariant of a Pair of Groups and the Direct Limit

In this paper we introduce the concept of generalized Baer-invariant of a pair of groups with respect to two varieties ? and ? of groups. We give some inequalities for the generalized Baer-invariant of a pair of finite groups, when ? is considered to be the Schur-Baer variety. Further, we present a sufficient condition under which the order of the generalized Baer-invariant of a pair of finite ...

متن کامل

Fillings, Finite Generation and Direct Limits of Relatively Hyperbolic Groups

We examine the relationship between finitely and infinitely generated relatively hyperbolic groups. We observe that direct limits of relatively hyperbolic groups are in fact direct limits of finitely generated relatively hyperbolic groups. We use this (and known results) to prove the Strong Novikov Conjecture for the groups constructed by Osin in [17].

متن کامل

NEW METHODS FOR CONSTRUCTING GENERALIZED GROUPS, TOPOLOGICAL GENERALIZED GROUPS, AND TOP SPACES

‎‎The purpose of this paper is to introduce new methods for constructing generalized groups, generalized topological groups and top spaces. We study some properties of these structures and present some relative concrete examples. Moreover, we obtain generalized groups by using of Hilbert spaces and tangent spaces of Lie groups, separately.

متن کامل

Heuristic and exact algorithms for Generalized Bin Covering Problem

In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 33  شماره No. 1

صفحات  47- 64

تاریخ انتشار 2011-01-20

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023